The Reachability Problem over Infinite Graphs
Identifieur interne : 003883 ( Main/Exploration ); précédent : 003882; suivant : 003884The Reachability Problem over Infinite Graphs
Auteurs : Wolfgang Thomas [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinite-state systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.
Url:
DOI: 10.1007/978-3-642-03351-3_2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003A68
- to stream Istex, to step Curation: 003A24
- to stream Istex, to step Checkpoint: 000990
- to stream Main, to step Merge: 003961
- to stream Main, to step Curation: 003883
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">The Reachability Problem over Infinite Graphs</title>
<author><name sortKey="Thomas, Wolfgang" sort="Thomas, Wolfgang" uniqKey="Thomas W" first="Wolfgang" last="Thomas">Wolfgang Thomas</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:F55C8CEDEA23F5C1FBC2EE0946130A57B1E3C579</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-03351-3_2</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-94RRRT1N-F/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003A68</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003A68</idno>
<idno type="wicri:Area/Istex/Curation">003A24</idno>
<idno type="wicri:Area/Istex/Checkpoint">000990</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000990</idno>
<idno type="wicri:doubleKey">0302-9743:2009:Thomas W:the:reachability:problem</idno>
<idno type="wicri:Area/Main/Merge">003961</idno>
<idno type="wicri:Area/Main/Curation">003883</idno>
<idno type="wicri:Area/Main/Exploration">003883</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">The Reachability Problem over Infinite Graphs</title>
<author><name sortKey="Thomas, Wolfgang" sort="Thomas, Wolfgang" uniqKey="Thomas W" first="Wolfgang" last="Thomas">Wolfgang Thomas</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>RWTH Aachen University, Lehrstuhl Informatik 7, 52056, Aachen</wicri:regionArea>
<placeName><region type="land" nuts="1">Rhénanie-du-Nord-Westphalie</region>
<region type="district" nuts="2">District de Cologne</region>
<settlement type="city">Aix-la-Chapelle</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinite-state systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>District de Cologne</li>
<li>Rhénanie-du-Nord-Westphalie</li>
</region>
<settlement><li>Aix-la-Chapelle</li>
</settlement>
</list>
<tree><country name="Allemagne"><region name="Rhénanie-du-Nord-Westphalie"><name sortKey="Thomas, Wolfgang" sort="Thomas, Wolfgang" uniqKey="Thomas W" first="Wolfgang" last="Thomas">Wolfgang Thomas</name>
</region>
<name sortKey="Thomas, Wolfgang" sort="Thomas, Wolfgang" uniqKey="Thomas W" first="Wolfgang" last="Thomas">Wolfgang Thomas</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003883 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003883 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:F55C8CEDEA23F5C1FBC2EE0946130A57B1E3C579 |texte= The Reachability Problem over Infinite Graphs }}
This area was generated with Dilib version V0.6.33. |